Incorporating Bidirectional Heuristic Search and Improved ACO in Route Planning
نویسندگان
چکیده
A multi-objective multi-node dynamic route planning system for a vehicle is presented in this paper. In this system, a bidirectional heuristic search algorithm is designed to perform path planning between two nodes in a topological map created by OpenStreetMap for urban scenarios. And then an improved multi-objective Ant Colony Optimization (ACO) algorithm considering the timeliness of goal nodes is proposed to generate the node sequence. Experimental results validated the proposed approach.
منابع مشابه
A Hybrid Ant Colony Optimization Algorithm for Network Routing and Planning
The mechanism of route search problem is applied to various engineering fields. The various researches for the dynamic routing only revile the shortest path from source to destination but not vice versa. Ant colony optimization (ACO) algorithms have proved to be able to adapt to dynamic optimization problems (DOPs) when stagnation behavior is avoided. Several approaches have been integrated wit...
متن کاملTime-dependent pheromones and electric-field model: a new ACO algorithm for dynamic traffic routing
In this paper, we present a dynamic ant colony optimisation (ACO) algorithm to solve dynamic traffic routing problem. The main objective of this work is to search out the least-time-cost route in a variable-edge-weight graph. We introduce time-dependent pheromones and electric-field model as two heuristic factors to improve the basic ACO. The simulation results show that the proposed dynamic AC...
متن کاملIIR System Identification Using Improved Harmony Search Algorithm with Chaos
Due to the fact that the error surface of adaptive infinite impulse response (IIR) systems is generally nonlinear and multimodal, the conventional derivative based techniques fail when used in adaptive identification of such systems. In this case, global optimization techniques are required in order to avoid the local minima. Harmony search (HS), a musical inspired metaheuristic, is a recently ...
متن کاملDiploma Thesis - Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
We present a route planning technique solely based on the concept of node contraction. We contract or remove one node at a time out of the graph and add shortcut edges to the remaining graph to preserve shortest paths distances. The resulting contraction hierarchy (CH), the original graph plus shortcuts, also defines an order of “importance” among all nodes through the node selection. We apply ...
متن کاملHybrid Aco-pso for Robotic Path Planning
In the context of robotic path planning, a common strategy is to assume that the world is static and believed on heuristic approaches and obstacle avoidance to deal with changes in the environment. When planning is not considered for potential changes of the environment into account usually leads to poor performances. In this paper, we propose a hybrid ACO-PSO approach that exploits the travers...
متن کامل